Multidisk Partial Match File Design with Known Access Pattern

The problem of multidisk partial match file design is a file allocation problem among multiple independently accessible disks so that, for all possible partial match queries, maximal disk access concurrency can be obtained. Since this problem has been shown to be NP-hard, there are a few heuristic methods based upon the Disk Modulo (DM) allocation method [5,6,9]. The file systems proposed for this problem are mainly based on Binary Cartesian Product Files [2,5,9], which have been shown to be very effective for partial match queries.